炮控伺服系统自抗扰控制器优化设计

针对自抗扰控制器参数难于整定的问题,给出了一种基于自适应变异粒子群优化算法的炮控伺服系统自抗扰控制器优化设计方法.该算法结构简单,具有良好的全局收敛性,充分发挥了自抗扰控制器的控制性能.通过对某炮控伺服系统的仿真研究,表明了该设计方法的有效性.     

炮兵火力任务分配的优化模型

现代作战,参战兵种多,炮兵的火力单位和类型更为复杂,不同的火力单位具有不同的毁伤效果,如何用最小的代价取得最大的军事效益,是一种火力任务分配的优化问题.根据不同炮种和目标的特点,建立在一定约束条件下的炮兵火力任务分配模型,并将其转化为指派问题,运用匈牙利算法求解,达到优化分配火力任务的目的.通过仿真计算证明这是辅助指挥员进行射击决策的一种有效手段,为作战指挥理论提供了一种新的数学模型.     

Coordinated dynamic control of marketing and production

We study the dynamic profit maximization problem for a firm exercising control on both marketing and production. The firs marketing effort impacts the current‐period demand, which in turn affects future demand in a dissipating fashion. Under linear‐cost and zero‐leadtime assumptions, we show that the firm should follow base‐point rules for both marketing and production, whereas trends of the base points reflect a certain complementarity between marketing and production. We obtain comparable results when marketing costs are convex. Our computational study identifies conditions under which simple fixed‐marketing‐effort and fixed‐marketing‐target heuristics would perform well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

一种基于蚁群算法的准动态防空武器分配算法

武器目标分配问题是一个典型的限制组合优化问题,旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题,提出了基于时间窗的准动态武器目标分配算法,该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标,并将该算法推广至多类防空武器的优化分配中。通过大量实验验证,该算法在性能、时间复杂度等方面均有较大优势,并且能较好地适应战场态势的变化,及时调整分配方案,具有很好的实用性。     

多阶段传感器-武器联合任务管理方法

针对动态环境下的传感器-武器联合任务管理问题展开研究。根据在动态作战过程中出现的有效新目标、有效空闲传感器和武器数量设定阶段门限,以决定进入下一阶段的时机,从而构建多阶段的作战过程。从打击方案质量及系统响应时间的角度出发,分析构建分布式作战体系对系统作战效能的影响,使系统在每个任务管理阶段可以决定响应流程。通过仿真实验验证了所构建的分布式作战体系与设定的阶段门限可以明显提升系统的作战效能。     

船艇发动机虚拟维修中的场景优化技术研究

针对船艇发动机虚拟维修场景构建过程中模型的高逼真度和实时交互之间的矛盾,提出了降低场景复杂度的初期建模优化技术,以及模型合成后的全景优化技术。通过在发动机虚拟维修训练系统中的综合应用,有效地简化了模型的多边形网格,降低了场景的复杂度,提高了场景的生成速度。     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于IJOTISPP的席位通信系统的设计与实现

一体化联合作战训练系统公共平台IJOTISPP（Integrated Joint Operation Training Information Systemic Public Platform）是军事训练信息系统建设的基础支撑平台。作为联合作战训练信息系统中的重要组成部分席位通信系统,也需在该平台上进行搭建与开发。介绍了IJOTISPP的基本原理,采用IJOTISPP提供的通信服务和Visual C＋＋.Net 2003开发工具进行系统开发,设计了该系统的基本架构,实现了各操作席位之间短信、文件的交互。现场运行表明：该系统具有操作简单、人机界面友好、性能稳定等特点,符合模拟训练中异地通信的要求。     

Optimization of reluctance accelerator efficiency by an improved discharging circuit

In this paper, an improved discharging circuit was proposed to quicken the decay of the current in the drive coil in a reluctance accelerator when the armature reaches the center of the coil. The aim of this is to prevent the suck-back effect caused by the residual current in drive coil. The method is adding a reverse charging branch with a small capacitor in the traditional pulsed discharging circuit. The results under the traditional circuit and the improved circuit were compared in a simulation. The experiment then verified the simulations and they had good agreement. Simulation and experiment both demonstrated the improved circuit can effectively prevent the suck-back effect and increase the efficiency. At the voltage of 800 V, an efficiency increase of 36.34% was obtained.